Towards Nominal Context-Free Model-Checking
نویسندگان
چکیده
Two kinds of automata are introduced, for recognising regular and context-free nominal languages. We compare their expressive power with that of analogous proposals in the literature. Some properties of our languages are proved, in particular that emptiness of a context-free nominal language L is decidable, and that the intersection of L with a regular nominal language is still context-free. This paves the way for model-checking systems against access control properties in the nominal case, which is our main objective.
منابع مشابه
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model checking a difficult task. In this note we survey some of the approaches for model checking nominal calculi. Then, we focus on History-Dependent automata, a syntax-free automaton-based model of mobility. History-Depend...
متن کاملModel Checking for Context-Free Processes
We develop a model-checking algorithm that decides for a given context-free process whether it satisses a property written in the alternation-free modal mu-calculus. The central idea behind this algorithm is to raise the standard iterative model-checking techniques to higher order: in contrast to the usual approaches, in which the set of formulas that are satissed by a certain state are iterati...
متن کاملComplete SAT-Based Model Checking for Context-Free Processes
A complete SAT-based model checking algorithm for contextfree processes is presented. We reduce proof search in local model checking to Boolean satisfiability. Bounded proof search can therefore be performed by SAT solvers. Moreover, the completion of proof search is reduced to Boolean unsatisfiability and hence can be checked by SAT solvers. By encoding the local model checking algorithm in [1...
متن کاملModel checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context-free programs. The algorithm shows that the model checking problem for PDL remains PTIME-complete in the presence of all these operators, in contrast to the high increase in complexity that they cause for the satisfia...
متن کاملOn universal algebra over nominal sets
Nominal sets were introduced by Gabbay and Pitts (Gabbay and Pitts, 1999). This paper describes a step towards universal algebra over nominal sets. There has been some work in this direction, most notably by M.J. Gabbay (Gabbay, 2008). The originality of our approach is that we do not start from the analogy between sets and nominal sets. As shown in (Gabbay, 2008), this is possible, but it requ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013